Information Retrieval from an Incomplete Data Cube

A complete data cube is a data cube. in which every aggregate value in the multidimensional space is stored or can be computed. An incomplete data cube is a data cube in which points in the multidimensional space are missing and’cannot be computed. This paper describes an incomplete data cube design. An incomplete data cube is modeled as a federation of cubettes. A cubette is a complete subcube within the incomplete data cube. The incomplete cube is built piecemeal by giving a concise, high-level specification of each cubette. An efficient algorithm to retrieve an aggregate value from the incomplete data cube is described. When a value cannot be retrieved because it is missing, alternatives at a lower precision that can be retrieved are identified. When a value can be partially comRuted (i.e., some of the values lower in the hierarchy are missing, but some are present) a measure of the completeness of the result is supplied along with the partially aggregated value. The design also includes an algorithm that removes redundant cubettes and an algorithm to increase the retrieval power of the federation thr%ugh the creation of virtual cubettes. Permission to copy without fee all OT part of this material is granted provided that the copies are not made OT distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Vesy Large Data Base Endowmeni. To copy otherwise, OT to Tepablish, requires a fee and/or special pesmission from the Endowment. Proceedings of the 22nd VLDB Conference Mumbai(Bombay), India, 1996